#include"Sort.h"

//void TestInsertSort()
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	InsertSort(arr, sizeof(arr) / sizeof(arr[0]));
//}

//void TestShellSort()
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	ShellSort(arr, sizeof(arr) / sizeof(arr[0]));
//	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
//}

//void TestSelectSort() 
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	SelectSort(arr, sizeof(arr) / sizeof(arr[0]));
//	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
//}

//void TestBubbleSort()
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	BubbleSort(arr, sizeof(arr) / sizeof(arr[0]));
//	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
//}
//
//void TestQuickSort()
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	QuickSortNon_R(arr, 0,sizeof(arr) / sizeof(arr[0])-1);
//	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
//}

//void TestMergeSort()
//{
//	int arr[] = { 13,2,43,23,34,6,8,54,78,99,123,444 };
//	MergeSort(arr,sizeof(arr) / sizeof(arr[0]));
//	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
//}

void TestCountSort()
{
	int arr[] = { -1,-2,3,4,6,19,-8,-10 };
	CountSort(arr, sizeof(arr) / sizeof(arr[0]));
	PrintSort(arr, sizeof(arr) / sizeof(arr[0]));
}

void TestOP()
{
	srand(time(NULL));
	const int N = 100000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	int i = 0;
	for (i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}

	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	//ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
    HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	//QuickSort(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	//MergeSort(a6, N);
	int end6 = clock();

	int begin7 = clock();
	//BubbleSort(a6, N);
	int end7 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("BubbleSort:%d\n", end7 - begin7);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);

	free(a1);
	a1 = NULL;
	free(a2);
	a2 = NULL;
	free(a3);
	a3 = NULL;
	free(a4);
	a4 = NULL;
	free(a5);
	a5 = NULL;
	free(a6);
	a6 = NULL;
}
int main()
{
	//TestOP();

	/*TestInsertSort();*/

	//TestShellSort();

	//TestSelectSort();

	//TestBubbleSort();

	//TestQuickSort();

	/*TestMergeSort();*/

	/*TestMergeSortNonR();*/

	TestCountSort();
	return 0;
}